Networks of Evolutionary Picture Processors with Filtered Connections
نویسندگان
چکیده
In this paper we simplify the model of computation considered in [1], namely network of evolutionary picture processors, by moving the filters from the nodes to the edges. Each edge is now viewed as a twoway channel such that input and output filters, respectively, of the two nodes connected by the edge coincide. Thus, the possibility of controlling the computation in such networks seems to be diminished. In spite of this observation all the results concerning the computational power of networks of evolutionary picture processors reported in [1] are extended over these simplified networks.
منابع مشابه
Simulating Accepting Networks of Evolutionary Processors with Filtered Connections by Accepting Evolutionary P Systems
In this work, we propose a variant of P system based on the rewriting of string-objects by means of evolutionary rules. The membrane structure of such a P system seems to be a very natural tool for simulating the filters in accepting networks of evolutionary processors with filtered connections. We discuss an informal construction supporting this simulation. A detailed proof is to be considered...
متن کاملSimulating Accepting Networks of Evolutionary Processors with Filtered Connections by Accepting Evolutionary P Systems - (Extended Abstract)
In this work, we propose a variant of P system based on the rewriting of string-objects by means of evolutionary rules. The membrane structure of such a P system seems to be a very natural tool for simulating the filters in accepting networks of evolutionary processors with filtered connections. We discuss an informal construction supporting this simulation. A detailed proof is to be considered...
متن کاملAccepting Networks of Evolutionary Processors with Filtered Connections
In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that input and output filters, respectively, of the two nodes connected by the edge coincide. Thus, the possibility of controlling the computation in ...
متن کاملSmall Universal Accepting Networks of Evolutionary Processors with Filtered Connections
In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs). We show that there are universal ANEPFCs of size 10, by devising a method for simulating 2-Tag Systems. This result significantly improves the known upper bound for the size of universal ANEPFCs which is 18. We also propose a new, computation...
متن کاملString Assembly in Networks of Evolutionary Processors
In this paper, we introduce a new way of communication in networks of evolutionary processors (NEPs) where the filtered communicated strings are appended according to different variants of the overlap operation. These NEPs aim at modelling self-assembly in complex biological systems. We show that these networks with three nodes are computationally complete devices, furthermore they are able to ...
متن کامل